Theory of Error - Correcting Codes
نویسنده
چکیده
The field of channel coding started with Claude Shannon’s 1948 landmark paper. Fifty years of efforts and invention have finally produced coding schemes that closely approach Shannon’s channel capacity limit on AWGN channels, both power-limited and band-limited. Similar gains are being achieved in other important applications, such as wireless channels. This course is divided in two parts. In the first part, we remind students of the basics of the theory of linear codes for conventional memoryless ergodic channels. We then introduce more advanced notions so as to make comprehensible some of the most recent coding schemes proposed in the literature. In the second part, we expound the principles of coded modulations for the Gaussian channel and, if time permits, for Rician and Rayleigh fading channels (fully interleaved). We will conclude the course by evoking some aspects of code design for non-ergodic block-fading channels.
منابع مشابه
One-point Goppa Codes on Some Genus 3 Curves with Applications in Quantum Error-Correcting Codes
We investigate one-point algebraic geometric codes CL(D, G) associated to maximal curves recently characterized by Tafazolian and Torres given by the affine equation yl = f(x), where f(x) is a separable polynomial of degree r relatively prime to l. We mainly focus on the curve y4 = x3 +x and Picard curves given by the equations y3 = x4-x and y3 = x4 -1. As a result, we obtain exact value of min...
متن کاملNew lower bounds and constructions for binary codes correcting asymmetric errors
In this correspondence, we study binary asymmetric errorcorrecting codes. A general construction for binary asymmetric error-correcting codes is presented. We show that some previously known lower bounds for binary asymmetric error-correcting codes can be obtained from this general construction. Furthermore, some new lower bounds for binary asymmetric error-correcting codes are obtained from th...
متن کاملError-correcting codes and Bh-sequences
We construct error-correcting (nonlinear) binary codes using a construction of Bose and Chowla in additive number theory. Our method extends a construction of Graham and Sloane for constant weight codes. The new codes improve 1028 of the 7168 best known h-error correcting codes of wordlength ≤ 512 with 1 ≤ h ≤ 14. We give asymptotical comparisons to shortened BCH codes.
متن کاملNew Double-Byte Error-Correcting Codes for Memory Systems
Error-correcting or error-detecting codes have been used in the computer industry to increase reliability, reduce service costs, and maintain data integrity. The single-byte error-correcting and double-byte error-detecting (SbEC-DbED) codes have been successfully used in computer memory subsystems. There are many methods to construct double-byte error-correcting (DbEC) codes. In the present pap...
متن کاملA class of multiple-error-correcting codes and the decoding scheme
linear error-correcting codes used in communications. (14) I. S. Reed, “A class of multiple-errorcorrecting codes and the decoding scheme,” IRE. Trans. A class of multiple-error-correcting codes and the decoding scheme. more. less. I. Reed · Details · Authors · Fields of science · Bibliography · Quotations · Similar. linear error correcting codes used in communications (2).For bit study is to d...
متن کاملAn approach to fault detection and correction in design of systems using of Turbo codes
We present an approach to design of fault tolerant computing systems. In this paper, a technique is employed that enable the combination of several codes, in order to obtain flexibility in the design of error correcting codes. Code combining techniques are very effective, which one of these codes are turbo codes. The Algorithm-based fault tolerance techniques that to detect errors rely on the c...
متن کامل